A formal support to business and architectural design for service-oriented systems

Architectural Design Rewriting (ADR) is an approach for the design of software architectures developed within Sensoria by reconciling graph transformation and process calculi techniques. The key feature that makes ADR a suitable and expressive framework is the algebraic handling of structured graphs, which improves the support for specification, analysis and verification of service-oriented architectures and applications. We show how ADR is used as a formal ground for high-level modelling languages and approaches developed within Sensoria

Algebraic Models for Contextual Nets

We extend the algebraic approach of Meseguer and Montanari from ordinary place/transition Petri nets to contextual nets, covering both the collective and the individual token philosophy uniformly along the two interpretations of net behaviors

Hierarchical models for service-oriented systems

We present our approach to the denotation and representation of hierarchical graphs: a suitable algebra of hierarchical graphs and two domains of interpretations. Each domain of interpretation focuses on a particular perspective of the graph hierarchy: the top view (nested boxes) is based on a notion of embedded graphs while the side view (tree hierarchy) is based on gs-graphs. Our algebra can be understood as a high-level language for describing such graphical models, which are well suited for defining graphical representations of service-oriented systems where nesting (e.g. sessions, transactions, locations) and linking (e.g. shared channels, resources, names) are key aspects

Evaluating the performance of model transformation styles in Maude

Rule-based programming has been shown to be very successful in many application areas. Two prominent examples are the specification of model transformations in model driven development approaches and the definition of structured operational semantics of formal languages. General rewriting frameworks such as Maude are flexible enough to allow the programmer to adopt and mix various rule styles. The choice between styles can be biased by the programmer’s background. For instance, experts in visual formalisms might prefer graph-rewriting styles, while experts in semantics might prefer structurally inductive rules. This paper evaluates the performance of different rule styles on a significant benchmark taken from the literature on model transformation. Depending on the actual transformation being carried out, our results show that different rule styles can offer drastically different performances. We point out the situations from which each rule style benefits to offer a valuable set of hints for choosing one style over the other

An Algebra of Hierarchical Graphs

We define an algebraic theory of hierarchical graphs, whose axioms characterise graph isomorphism: two terms are equated exactly when they represent the same graph. Our algebra can be understood as a high-level language for describing graphs with a node-sharing, embedding structure, and it is then well suited for defining graphical representations of software models where nesting and linking are key aspects

Functorial Semantics for Petri Nets under the Individual Token Philosophy

Although the algebraic semantics of place/transition Petri nets under the collective token philosophy has been fully explained in terms of (strictly) symmetric (strict) monoidal categories, the analogous construction under the individual token philosophy is not completely satisfactory because it lacks universality and also functoriality. We introduce the notion of pre-net to recover these aspects, obtaining a fully satisfactory categorical treatment centered on the notion of adjunction. This allows us to present a purely logical description of net behaviours under the individual token philosophy in terms of theories and theory morphisms in partial membership equational logic, yielding a complete match with the theory developed by the authors for the collective token view of net

Integrating Dynamics and Wear Modelling to Predict Railway Wheel Profile Evolution

The aim of the work described was to predict wheel profile evolution by integrating multi-body dynamics simulations of a wheelset with a wear model. The wear modelling approach is based on a wear index commonly used in rail wear predictions. This assumes wear is proportional to Tγ, where T is tractive force and γ is slip at the wheel/rail interface. Twin disc testing of rail and wheel materials was carried out to generate wear coefficients for use in the model. The modelling code is interfaced with ADAMS/Rail, which produces multi-body dynamics simulations of a railway wheelset and contact conditions at the wheel/rail interface. Simplified theory of rolling contact is used to discretise the contact patches produced by ADAMS/Rail and calculate traction and slip within each. The wear model combines the simplified theory of rolling contact, ADAMS/Rail output and the wear coefficients to predict the wear and hence the change of wheel profile for given track layouts

SCC: A Service Centered Calculus

We seek for a small set of primitives that might serve as a basis for formalising and programming service oriented applications over global computers. As an outcome of this study we introduce here SCC, a process calculus that features explicit notions of service definition, service invocation and session handling. Our proposal has been influenced by Orc, a programming model for structured orchestration of services, but the SCC’s session handling mechanism allows for the definition of structured interaction protocols, more complex than the basic request-response provided by Orc. We present syntax and operational semantics of SCC and a number of simple but nontrivial programming examples that demonstrate flexibility of the chosen set of primitives. A few encodings are also provided to relate our proposal with existing ones

Two-parameter non-linear spacetime perturbations: gauge transformations and gauge invariance

An implicit fundamental assumption in relativistic perturbation theory is that there exists a parametric family of spacetimes that can be Taylor expanded around a background. The choice of the latter is crucial to obtain a manageable theory, so that it is sometime convenient to construct a perturbative formalism based on two (or more) parameters. The study of perturbations of rotating stars is a good example: in this case one can treat the stationary axisymmetric star using a slow rotation approximation (expansion in the angular velocity Omega), so that the background is spherical. Generic perturbations of the rotating star (say parametrized by lambda) are then built on top of the axisymmetric perturbations in Omega. Clearly, any interesting physics requires non-linear perturbations, as at least terms lambda Omega need to be considered. In this paper we analyse the gauge dependence of non-linear perturbations depending on two parameters, derive explicit higher order gauge transformation rules, and define gauge invariance. The formalism is completely general and can be used in different applications of general relativity or any other spacetime theory.Comment: 22 pages, 3 figures. Minor changes to match the version appeared in Classical and Quantum Gravit